Possibilistic and Extended Logic Programs
نویسنده
چکیده
Based on our earlier work on partial logics and extended logic programs Wag91, Wag94, HJW96], and on the possibilistic logic of DLP94], we deene a compositional possibilistic rst-order logic with two kinds of negation as the logical basis of semi-possibilistic and possibilis-tic logic programs. We show that in the same way as the minimal model semantics of relational databases can be reened to the stable model semantics for normal logic programs (see GL88]), the minimal model semantics of fuzzy databases can be reened to the stable semantics for semi-possibilistic logic programs. We also show that while normal logic programs under the stable model semantics can be embedded in semi-possibilistic logic programs under our stable semantics, extended logic programs under the answer set semantics of GL90] can be embedded in possibilistic logic programs under our stable semantics.
منابع مشابه
From Partial to Possibilistic Logic
Based on our earlier work on partial logics and extended logic programs [Wag91, Wag94, HJW96], and on the possibilistic logic of [DLP94], we de ne a compositional possibilistic rst-order logic with two kinds of negation.
متن کاملPossibilistic Nested Logic Programs
We introduce the class of possibilistic nested logic programs. These possibilistic logic programs allow us to use nested expressions in the bodies and the heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibili...
متن کاملSemantics for Possibilistic Disjunctive Programs
In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic th...
متن کاملPstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. Moreover being closer to possibilistic inference it allows to extend the necessity-values of the clauses to be considered, causing a higher level of comparison at the moment of sel...
متن کاملPossibilistic Safe Beliefs vs. Possibilistic Stable Models
In any learning process, the learners arrive with a great deal of variables, such as their different learning styles, their affective states and their previous knowledge, among many others. In most cases, their previous knowledge is incomplete or it comes with a certain degree of uncertainty. Possibilistic Logic was developed as an approach to automated reasoning from uncertain or prioritized i...
متن کامل